Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

minus_active2(0, y) -> 0
mark1(0) -> 0
minus_active2(s1(x), s1(y)) -> minus_active2(x, y)
mark1(s1(x)) -> s1(mark1(x))
ge_active2(x, 0) -> true
mark1(minus2(x, y)) -> minus_active2(x, y)
ge_active2(0, s1(y)) -> false
mark1(ge2(x, y)) -> ge_active2(x, y)
ge_active2(s1(x), s1(y)) -> ge_active2(x, y)
mark1(div2(x, y)) -> div_active2(mark1(x), y)
div_active2(0, s1(y)) -> 0
mark1(if3(x, y, z)) -> if_active3(mark1(x), y, z)
div_active2(s1(x), s1(y)) -> if_active3(ge_active2(x, y), s1(div2(minus2(x, y), s1(y))), 0)
if_active3(true, x, y) -> mark1(x)
minus_active2(x, y) -> minus2(x, y)
if_active3(false, x, y) -> mark1(y)
ge_active2(x, y) -> ge2(x, y)
if_active3(x, y, z) -> if3(x, y, z)
div_active2(x, y) -> div2(x, y)

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

minus_active2(0, y) -> 0
mark1(0) -> 0
minus_active2(s1(x), s1(y)) -> minus_active2(x, y)
mark1(s1(x)) -> s1(mark1(x))
ge_active2(x, 0) -> true
mark1(minus2(x, y)) -> minus_active2(x, y)
ge_active2(0, s1(y)) -> false
mark1(ge2(x, y)) -> ge_active2(x, y)
ge_active2(s1(x), s1(y)) -> ge_active2(x, y)
mark1(div2(x, y)) -> div_active2(mark1(x), y)
div_active2(0, s1(y)) -> 0
mark1(if3(x, y, z)) -> if_active3(mark1(x), y, z)
div_active2(s1(x), s1(y)) -> if_active3(ge_active2(x, y), s1(div2(minus2(x, y), s1(y))), 0)
if_active3(true, x, y) -> mark1(x)
minus_active2(x, y) -> minus2(x, y)
if_active3(false, x, y) -> mark1(y)
ge_active2(x, y) -> ge2(x, y)
if_active3(x, y, z) -> if3(x, y, z)
div_active2(x, y) -> div2(x, y)

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

DIV_ACTIVE2(s1(x), s1(y)) -> GE_ACTIVE2(x, y)
IF_ACTIVE3(true, x, y) -> MARK1(x)
GE_ACTIVE2(s1(x), s1(y)) -> GE_ACTIVE2(x, y)
DIV_ACTIVE2(s1(x), s1(y)) -> IF_ACTIVE3(ge_active2(x, y), s1(div2(minus2(x, y), s1(y))), 0)
MARK1(if3(x, y, z)) -> MARK1(x)
MARK1(s1(x)) -> MARK1(x)
MARK1(ge2(x, y)) -> GE_ACTIVE2(x, y)
MARK1(div2(x, y)) -> DIV_ACTIVE2(mark1(x), y)
MARK1(div2(x, y)) -> MARK1(x)
MARK1(minus2(x, y)) -> MINUS_ACTIVE2(x, y)
MINUS_ACTIVE2(s1(x), s1(y)) -> MINUS_ACTIVE2(x, y)
IF_ACTIVE3(false, x, y) -> MARK1(y)
MARK1(if3(x, y, z)) -> IF_ACTIVE3(mark1(x), y, z)

The TRS R consists of the following rules:

minus_active2(0, y) -> 0
mark1(0) -> 0
minus_active2(s1(x), s1(y)) -> minus_active2(x, y)
mark1(s1(x)) -> s1(mark1(x))
ge_active2(x, 0) -> true
mark1(minus2(x, y)) -> minus_active2(x, y)
ge_active2(0, s1(y)) -> false
mark1(ge2(x, y)) -> ge_active2(x, y)
ge_active2(s1(x), s1(y)) -> ge_active2(x, y)
mark1(div2(x, y)) -> div_active2(mark1(x), y)
div_active2(0, s1(y)) -> 0
mark1(if3(x, y, z)) -> if_active3(mark1(x), y, z)
div_active2(s1(x), s1(y)) -> if_active3(ge_active2(x, y), s1(div2(minus2(x, y), s1(y))), 0)
if_active3(true, x, y) -> mark1(x)
minus_active2(x, y) -> minus2(x, y)
if_active3(false, x, y) -> mark1(y)
ge_active2(x, y) -> ge2(x, y)
if_active3(x, y, z) -> if3(x, y, z)
div_active2(x, y) -> div2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

DIV_ACTIVE2(s1(x), s1(y)) -> GE_ACTIVE2(x, y)
IF_ACTIVE3(true, x, y) -> MARK1(x)
GE_ACTIVE2(s1(x), s1(y)) -> GE_ACTIVE2(x, y)
DIV_ACTIVE2(s1(x), s1(y)) -> IF_ACTIVE3(ge_active2(x, y), s1(div2(minus2(x, y), s1(y))), 0)
MARK1(if3(x, y, z)) -> MARK1(x)
MARK1(s1(x)) -> MARK1(x)
MARK1(ge2(x, y)) -> GE_ACTIVE2(x, y)
MARK1(div2(x, y)) -> DIV_ACTIVE2(mark1(x), y)
MARK1(div2(x, y)) -> MARK1(x)
MARK1(minus2(x, y)) -> MINUS_ACTIVE2(x, y)
MINUS_ACTIVE2(s1(x), s1(y)) -> MINUS_ACTIVE2(x, y)
IF_ACTIVE3(false, x, y) -> MARK1(y)
MARK1(if3(x, y, z)) -> IF_ACTIVE3(mark1(x), y, z)

The TRS R consists of the following rules:

minus_active2(0, y) -> 0
mark1(0) -> 0
minus_active2(s1(x), s1(y)) -> minus_active2(x, y)
mark1(s1(x)) -> s1(mark1(x))
ge_active2(x, 0) -> true
mark1(minus2(x, y)) -> minus_active2(x, y)
ge_active2(0, s1(y)) -> false
mark1(ge2(x, y)) -> ge_active2(x, y)
ge_active2(s1(x), s1(y)) -> ge_active2(x, y)
mark1(div2(x, y)) -> div_active2(mark1(x), y)
div_active2(0, s1(y)) -> 0
mark1(if3(x, y, z)) -> if_active3(mark1(x), y, z)
div_active2(s1(x), s1(y)) -> if_active3(ge_active2(x, y), s1(div2(minus2(x, y), s1(y))), 0)
if_active3(true, x, y) -> mark1(x)
minus_active2(x, y) -> minus2(x, y)
if_active3(false, x, y) -> mark1(y)
ge_active2(x, y) -> ge2(x, y)
if_active3(x, y, z) -> if3(x, y, z)
div_active2(x, y) -> div2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 3 SCCs with 3 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

GE_ACTIVE2(s1(x), s1(y)) -> GE_ACTIVE2(x, y)

The TRS R consists of the following rules:

minus_active2(0, y) -> 0
mark1(0) -> 0
minus_active2(s1(x), s1(y)) -> minus_active2(x, y)
mark1(s1(x)) -> s1(mark1(x))
ge_active2(x, 0) -> true
mark1(minus2(x, y)) -> minus_active2(x, y)
ge_active2(0, s1(y)) -> false
mark1(ge2(x, y)) -> ge_active2(x, y)
ge_active2(s1(x), s1(y)) -> ge_active2(x, y)
mark1(div2(x, y)) -> div_active2(mark1(x), y)
div_active2(0, s1(y)) -> 0
mark1(if3(x, y, z)) -> if_active3(mark1(x), y, z)
div_active2(s1(x), s1(y)) -> if_active3(ge_active2(x, y), s1(div2(minus2(x, y), s1(y))), 0)
if_active3(true, x, y) -> mark1(x)
minus_active2(x, y) -> minus2(x, y)
if_active3(false, x, y) -> mark1(y)
ge_active2(x, y) -> ge2(x, y)
if_active3(x, y, z) -> if3(x, y, z)
div_active2(x, y) -> div2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


GE_ACTIVE2(s1(x), s1(y)) -> GE_ACTIVE2(x, y)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(GE_ACTIVE2(x1, x2)) = 2·x1 + 2·x2   
POL(s1(x1)) = 2 + x1   

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

minus_active2(0, y) -> 0
mark1(0) -> 0
minus_active2(s1(x), s1(y)) -> minus_active2(x, y)
mark1(s1(x)) -> s1(mark1(x))
ge_active2(x, 0) -> true
mark1(minus2(x, y)) -> minus_active2(x, y)
ge_active2(0, s1(y)) -> false
mark1(ge2(x, y)) -> ge_active2(x, y)
ge_active2(s1(x), s1(y)) -> ge_active2(x, y)
mark1(div2(x, y)) -> div_active2(mark1(x), y)
div_active2(0, s1(y)) -> 0
mark1(if3(x, y, z)) -> if_active3(mark1(x), y, z)
div_active2(s1(x), s1(y)) -> if_active3(ge_active2(x, y), s1(div2(minus2(x, y), s1(y))), 0)
if_active3(true, x, y) -> mark1(x)
minus_active2(x, y) -> minus2(x, y)
if_active3(false, x, y) -> mark1(y)
ge_active2(x, y) -> ge2(x, y)
if_active3(x, y, z) -> if3(x, y, z)
div_active2(x, y) -> div2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

MINUS_ACTIVE2(s1(x), s1(y)) -> MINUS_ACTIVE2(x, y)

The TRS R consists of the following rules:

minus_active2(0, y) -> 0
mark1(0) -> 0
minus_active2(s1(x), s1(y)) -> minus_active2(x, y)
mark1(s1(x)) -> s1(mark1(x))
ge_active2(x, 0) -> true
mark1(minus2(x, y)) -> minus_active2(x, y)
ge_active2(0, s1(y)) -> false
mark1(ge2(x, y)) -> ge_active2(x, y)
ge_active2(s1(x), s1(y)) -> ge_active2(x, y)
mark1(div2(x, y)) -> div_active2(mark1(x), y)
div_active2(0, s1(y)) -> 0
mark1(if3(x, y, z)) -> if_active3(mark1(x), y, z)
div_active2(s1(x), s1(y)) -> if_active3(ge_active2(x, y), s1(div2(minus2(x, y), s1(y))), 0)
if_active3(true, x, y) -> mark1(x)
minus_active2(x, y) -> minus2(x, y)
if_active3(false, x, y) -> mark1(y)
ge_active2(x, y) -> ge2(x, y)
if_active3(x, y, z) -> if3(x, y, z)
div_active2(x, y) -> div2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


MINUS_ACTIVE2(s1(x), s1(y)) -> MINUS_ACTIVE2(x, y)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(MINUS_ACTIVE2(x1, x2)) = 2·x1 + 2·x2   
POL(s1(x1)) = 2 + x1   

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

minus_active2(0, y) -> 0
mark1(0) -> 0
minus_active2(s1(x), s1(y)) -> minus_active2(x, y)
mark1(s1(x)) -> s1(mark1(x))
ge_active2(x, 0) -> true
mark1(minus2(x, y)) -> minus_active2(x, y)
ge_active2(0, s1(y)) -> false
mark1(ge2(x, y)) -> ge_active2(x, y)
ge_active2(s1(x), s1(y)) -> ge_active2(x, y)
mark1(div2(x, y)) -> div_active2(mark1(x), y)
div_active2(0, s1(y)) -> 0
mark1(if3(x, y, z)) -> if_active3(mark1(x), y, z)
div_active2(s1(x), s1(y)) -> if_active3(ge_active2(x, y), s1(div2(minus2(x, y), s1(y))), 0)
if_active3(true, x, y) -> mark1(x)
minus_active2(x, y) -> minus2(x, y)
if_active3(false, x, y) -> mark1(y)
ge_active2(x, y) -> ge2(x, y)
if_active3(x, y, z) -> if3(x, y, z)
div_active2(x, y) -> div2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

MARK1(if3(x, y, z)) -> MARK1(x)
MARK1(s1(x)) -> MARK1(x)
IF_ACTIVE3(true, x, y) -> MARK1(x)
MARK1(div2(x, y)) -> DIV_ACTIVE2(mark1(x), y)
MARK1(div2(x, y)) -> MARK1(x)
IF_ACTIVE3(false, x, y) -> MARK1(y)
MARK1(if3(x, y, z)) -> IF_ACTIVE3(mark1(x), y, z)
DIV_ACTIVE2(s1(x), s1(y)) -> IF_ACTIVE3(ge_active2(x, y), s1(div2(minus2(x, y), s1(y))), 0)

The TRS R consists of the following rules:

minus_active2(0, y) -> 0
mark1(0) -> 0
minus_active2(s1(x), s1(y)) -> minus_active2(x, y)
mark1(s1(x)) -> s1(mark1(x))
ge_active2(x, 0) -> true
mark1(minus2(x, y)) -> minus_active2(x, y)
ge_active2(0, s1(y)) -> false
mark1(ge2(x, y)) -> ge_active2(x, y)
ge_active2(s1(x), s1(y)) -> ge_active2(x, y)
mark1(div2(x, y)) -> div_active2(mark1(x), y)
div_active2(0, s1(y)) -> 0
mark1(if3(x, y, z)) -> if_active3(mark1(x), y, z)
div_active2(s1(x), s1(y)) -> if_active3(ge_active2(x, y), s1(div2(minus2(x, y), s1(y))), 0)
if_active3(true, x, y) -> mark1(x)
minus_active2(x, y) -> minus2(x, y)
if_active3(false, x, y) -> mark1(y)
ge_active2(x, y) -> ge2(x, y)
if_active3(x, y, z) -> if3(x, y, z)
div_active2(x, y) -> div2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


MARK1(s1(x)) -> MARK1(x)
MARK1(div2(x, y)) -> MARK1(x)
DIV_ACTIVE2(s1(x), s1(y)) -> IF_ACTIVE3(ge_active2(x, y), s1(div2(minus2(x, y), s1(y))), 0)
The remaining pairs can at least be oriented weakly.

MARK1(if3(x, y, z)) -> MARK1(x)
IF_ACTIVE3(true, x, y) -> MARK1(x)
MARK1(div2(x, y)) -> DIV_ACTIVE2(mark1(x), y)
IF_ACTIVE3(false, x, y) -> MARK1(y)
MARK1(if3(x, y, z)) -> IF_ACTIVE3(mark1(x), y, z)
Used ordering: Polynomial interpretation [21]:

POL(0) = 2   
POL(DIV_ACTIVE2(x1, x2)) = 1 + 3·x1   
POL(IF_ACTIVE3(x1, x2, x3)) = x2 + x3   
POL(MARK1(x1)) = x1   
POL(div2(x1, x2)) = 1 + 3·x1   
POL(div_active2(x1, x2)) = 1 + 3·x1   
POL(false) = 0   
POL(ge2(x1, x2)) = 0   
POL(ge_active2(x1, x2)) = 0   
POL(if3(x1, x2, x3)) = x1 + x2 + 2·x3   
POL(if_active3(x1, x2, x3)) = x1 + x2 + 2·x3   
POL(mark1(x1)) = x1   
POL(minus2(x1, x2)) = x1   
POL(minus_active2(x1, x2)) = x1   
POL(s1(x1)) = 3 + x1   
POL(true) = 0   

The following usable rules [14] were oriented:

ge_active2(s1(x), s1(y)) -> ge_active2(x, y)
mark1(s1(x)) -> s1(mark1(x))
minus_active2(s1(x), s1(y)) -> minus_active2(x, y)
if_active3(x, y, z) -> if3(x, y, z)
mark1(ge2(x, y)) -> ge_active2(x, y)
minus_active2(x, y) -> minus2(x, y)
div_active2(x, y) -> div2(x, y)
div_active2(0, s1(y)) -> 0
mark1(minus2(x, y)) -> minus_active2(x, y)
minus_active2(0, y) -> 0
ge_active2(0, s1(y)) -> false
ge_active2(x, 0) -> true
if_active3(true, x, y) -> mark1(x)
mark1(if3(x, y, z)) -> if_active3(mark1(x), y, z)
if_active3(false, x, y) -> mark1(y)
div_active2(s1(x), s1(y)) -> if_active3(ge_active2(x, y), s1(div2(minus2(x, y), s1(y))), 0)
mark1(div2(x, y)) -> div_active2(mark1(x), y)
ge_active2(x, y) -> ge2(x, y)
mark1(0) -> 0



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

MARK1(if3(x, y, z)) -> MARK1(x)
IF_ACTIVE3(true, x, y) -> MARK1(x)
MARK1(div2(x, y)) -> DIV_ACTIVE2(mark1(x), y)
IF_ACTIVE3(false, x, y) -> MARK1(y)
MARK1(if3(x, y, z)) -> IF_ACTIVE3(mark1(x), y, z)

The TRS R consists of the following rules:

minus_active2(0, y) -> 0
mark1(0) -> 0
minus_active2(s1(x), s1(y)) -> minus_active2(x, y)
mark1(s1(x)) -> s1(mark1(x))
ge_active2(x, 0) -> true
mark1(minus2(x, y)) -> minus_active2(x, y)
ge_active2(0, s1(y)) -> false
mark1(ge2(x, y)) -> ge_active2(x, y)
ge_active2(s1(x), s1(y)) -> ge_active2(x, y)
mark1(div2(x, y)) -> div_active2(mark1(x), y)
div_active2(0, s1(y)) -> 0
mark1(if3(x, y, z)) -> if_active3(mark1(x), y, z)
div_active2(s1(x), s1(y)) -> if_active3(ge_active2(x, y), s1(div2(minus2(x, y), s1(y))), 0)
if_active3(true, x, y) -> mark1(x)
minus_active2(x, y) -> minus2(x, y)
if_active3(false, x, y) -> mark1(y)
ge_active2(x, y) -> ge2(x, y)
if_active3(x, y, z) -> if3(x, y, z)
div_active2(x, y) -> div2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 1 less node.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ DependencyGraphProof
                  ↳ QDP
                    ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

MARK1(if3(x, y, z)) -> MARK1(x)
IF_ACTIVE3(true, x, y) -> MARK1(x)
IF_ACTIVE3(false, x, y) -> MARK1(y)
MARK1(if3(x, y, z)) -> IF_ACTIVE3(mark1(x), y, z)

The TRS R consists of the following rules:

minus_active2(0, y) -> 0
mark1(0) -> 0
minus_active2(s1(x), s1(y)) -> minus_active2(x, y)
mark1(s1(x)) -> s1(mark1(x))
ge_active2(x, 0) -> true
mark1(minus2(x, y)) -> minus_active2(x, y)
ge_active2(0, s1(y)) -> false
mark1(ge2(x, y)) -> ge_active2(x, y)
ge_active2(s1(x), s1(y)) -> ge_active2(x, y)
mark1(div2(x, y)) -> div_active2(mark1(x), y)
div_active2(0, s1(y)) -> 0
mark1(if3(x, y, z)) -> if_active3(mark1(x), y, z)
div_active2(s1(x), s1(y)) -> if_active3(ge_active2(x, y), s1(div2(minus2(x, y), s1(y))), 0)
if_active3(true, x, y) -> mark1(x)
minus_active2(x, y) -> minus2(x, y)
if_active3(false, x, y) -> mark1(y)
ge_active2(x, y) -> ge2(x, y)
if_active3(x, y, z) -> if3(x, y, z)
div_active2(x, y) -> div2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


MARK1(if3(x, y, z)) -> MARK1(x)
IF_ACTIVE3(true, x, y) -> MARK1(x)
IF_ACTIVE3(false, x, y) -> MARK1(y)
MARK1(if3(x, y, z)) -> IF_ACTIVE3(mark1(x), y, z)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(0) = 0   
POL(IF_ACTIVE3(x1, x2, x3)) = 3 + 3·x2 + 3·x3   
POL(MARK1(x1)) = 3·x1   
POL(div2(x1, x2)) = 0   
POL(div_active2(x1, x2)) = 0   
POL(false) = 0   
POL(ge2(x1, x2)) = 0   
POL(ge_active2(x1, x2)) = 0   
POL(if3(x1, x2, x3)) = 3 + 3·x1 + x2 + x3   
POL(if_active3(x1, x2, x3)) = 0   
POL(mark1(x1)) = 0   
POL(minus2(x1, x2)) = 0   
POL(minus_active2(x1, x2)) = 0   
POL(s1(x1)) = 0   
POL(true) = 0   

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ DependencyGraphProof
                  ↳ QDP
                    ↳ QDPOrderProof
                      ↳ QDP
                        ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

minus_active2(0, y) -> 0
mark1(0) -> 0
minus_active2(s1(x), s1(y)) -> minus_active2(x, y)
mark1(s1(x)) -> s1(mark1(x))
ge_active2(x, 0) -> true
mark1(minus2(x, y)) -> minus_active2(x, y)
ge_active2(0, s1(y)) -> false
mark1(ge2(x, y)) -> ge_active2(x, y)
ge_active2(s1(x), s1(y)) -> ge_active2(x, y)
mark1(div2(x, y)) -> div_active2(mark1(x), y)
div_active2(0, s1(y)) -> 0
mark1(if3(x, y, z)) -> if_active3(mark1(x), y, z)
div_active2(s1(x), s1(y)) -> if_active3(ge_active2(x, y), s1(div2(minus2(x, y), s1(y))), 0)
if_active3(true, x, y) -> mark1(x)
minus_active2(x, y) -> minus2(x, y)
if_active3(false, x, y) -> mark1(y)
ge_active2(x, y) -> ge2(x, y)
if_active3(x, y, z) -> if3(x, y, z)
div_active2(x, y) -> div2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.